Software-Defined Networking (SDN) has become a significant topic of discussion among the network\nservice providers, operators, and equipment vendors where control planes are separated from the data\nplane in networking devices. This paper implements Bellman-Ford algorithm for computing the shortest\npath in Software-Defined Networking using Mininet emulator. Bellmanââ?¬â??Ford algorithm computes\nshortest paths from a single source vertex to all of the other vertices in a weighted digraph. This algorithm\nis versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers.\nAll the simulation has been done using POX as an OpenFlow controller, OpenvSwitch (OVS) as a\nforwarding function and Mininet which installed on Ubuntu Virtual Machine (VM). The result of this\npaper shows that the simulation of SDN with OpenvSwitch (OVS) and POX controller runs BellmanFord\nalgorithm for finding the minimum path among the designed network topology.
Loading....